Ranks of linear matrix pencils separate simultaneous similarity orbits

نویسندگان

چکیده

This paper solves the two-sided version and provides a counterexample to general of 2003 conjecture by Hadwin Larson. Consider evaluations linear matrix pencils $L=T_0+x_1T_1+\cdots+x_mT_m$ on tuples as $L(X_1,\dots,X_m)=I\otimes T_0+X_1\otimes T_1+\cdots+X_m\otimes T_m$. It is shown that ranks constitute collection separating invariants for simultaneous similarity tuples. That is, $m$-tuples $A$ $B$ $n\times n$ matrices are simultaneously similar if only $L(A)$ $L(B)$ equal all $L$ size $mn$. Variants this property also established symplectic, orthogonal, unitary similarity, left-right action groups. Furthermore, polynomial time algorithm orbit equivalence under special groups deduced.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the closures of orbits of fourth order matrix pencils

In this work we state a simple criterion for nilpotentness of a square n×n matrix pencil with respect to the action of SLn(C)×SLn(C)×SL2(C). The orbits of matrix pencils are classified explicitly for n = 4 and the hierarchy of closures of nilpotent orbits is described. Also, we prove that the algebra of invariants of the action of SLn(C)× SLn(C)× SL2(C) on C ⊗ C ⊗ C is isomorphic to the algebra...

متن کامل

Stratification of Matrix Pencils

To design a modern control system is a complex problem which requires high qualitative software. This software must be based on robust algorithms and numerical stable methods which both can provide quantitative as well as qualitative information. In this Licentiate Thesis, the focus is on the qualitative information. The aim is to grasp the underlying advanced mathematical theory and provide al...

متن کامل

Balancing Regular Matrix Pencils

In this paper we present a new diagonal balancing technique for regular matrix pencils λB − A, which aims at reducing the sensitivity of the corresponding generalized eigenvalues. It is inspired from the balancing technique of a square matrix A and has a comparable complexity. Upon convergence, the diagonally scaled pencil has row and column norms that are balanced in a precise sense. We also s...

متن کامل

Matrix pencils and entanglement classification

Quantum entanglement plays a central role in quantum information processing. A main objective of the theory is to classify different types of entanglement according to their interconvertibility through manipulations that do not require additional entanglement to perform. While bipartite entanglement is well understood in this framework, the classification of entanglements among three or more su...

متن کامل

Displacement Ranks of a Matrix

The solution of many problems in physics and engineering reduces ultimately to the solution of linear equations of the form Ra = m, where JR and m are given N x N and N x 1 matrices and a is to be determined. Here our concern is with the fact that it generally takes 0(N) computations (one computation being the multiplication of two real numbers) to do this, and this might be a substantial burde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 2023

ISSN: ['1857-8365', '1857-8438']

DOI: https://doi.org/10.1016/j.aim.2023.108888